Information Transfer Bounds on Iterative Thresholds of Staircase Codes
نویسندگان
چکیده
We consider staircase codes and study their performance using an analysis of the decoding information flow. We derive bounds on the information transfer functions for long binary linear codes serving as component codes for staircase ensembles and compute them for several BCH codes and bounded distance decoding. The resulting expressions are used to obtain upper bounds on the iterative thresholds of staircase code ensembles used for communication over the binary symmetric channel.
منابع مشابه
Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes
We consider the setting of a Master server, M, who possesses confidential data (e.g., personal, genomic or medical data) and wants to run intensive computations on it, as part of a machine learning algorithm for example. The Master wants to distribute these computations to untrusted workers who have volunteered or are incentivized to help with this task. However, the data must be kept private (...
متن کاملFinite-Dimensional Bounds on Zm and Binary LDPC Codes with Belief Propagation Decoders
This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of Zm and binary lowdensity parity-check (LDPC) codes, assuming belief propagation decoding on memoryless channels. A concrete framework is presented, admitting systematic searches for new bounds. Two noise measures are considered: the Bhattacharyya noise parameter and the soft bit value for a maximum a post...
متن کاملDifferentially Encoded LDPC Codes - Part I: Special Case of Product Accumulate Codes
Part I of a two-part series investigates product accumulate codes, a special class of differentially-encoded low density parity check (DE-LDPC) codes with high performance and low complexity, on flat Rayleigh fading channels. In the coherent detection case, Divsalar’s simple bounds and iterative thresholds using density evolution are computed to quantify the code performance at finite and infin...
متن کاملOn Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
This paper considers the achievable rates and decoding complexity of low-density parity-check (LDPC) codes over statistically independent parallel channels. The paper starts with the derivation of bounds on the conditional entropy of the transmitted codeword given the received sequence at the output of the parallel channels; the component channels are considered to be memoryless, binary-input, ...
متن کاملFinite-Dimensional Bounds on Zm and Binary LDPC Codes with Belief Propagation Decoders: Stability Conditions on Zm Codes and Cutoff Rate Analysis on Non-symmetric Binary Channels
This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of Z m and binary LDPC codes, assuming belief propagation decoding on memoryless channels. Two noise measures will be considered: the Bhattacharyya noise parameter and the soft bit value for a MAP decoder on the uncoded channel. For Z m LDPC codes, an iterative m-dimensional bound is derived for m-ary-input/...
متن کامل